Privacy preserving clustering on horizontally partitioned data
نویسندگان
چکیده
منابع مشابه
Analysis of Privacy Preserving Clustering Approach over Horizontally Partitioned Data
Data mining is the most current topic in research area. From a very long time we are working on this topic that is how we can secure our database. There are many problems which are associated with this topic like data missing, data lost, hence we explain some approaches like hierarichal clustering, homomorphic encryption, k-means clustering and SMC by these techniques database which is horizont...
متن کاملPhoenix: Privacy Preserving Biclustering on Horizontally Partitioned Data
Emerging business models require organizations to collaborate with each other. This collaboration is usually in the form of distributed clustering to find optimal customer targets for effective marketing. This process is hampered by two problems (1) Inability of traditional clustering algorithm in finding local (subspace) patterns in distributed data and (2) Privacy policies of individual organ...
متن کاملUtility Independent Privacy Preserving Data Mining - Horizontally Partitioned Data
Micro data is a valuable source of information for research. However, publishing data about individuals for research purposes, without revealing sensitive information, is an important problem. The main objective of privacy preserving data mining algorithms is to obtain accurate results/rules by analyzing the maximum possible amount of data without unintended information disclosure. Data sets fo...
متن کاملPrivacy-preserving horizontally partitioned linear programs
We propose a simple privacy-preserving reformulation of a linear program whose equality constraint matrix is partitioned into groups of rows. Each group of matrix rows and its corresponding right hand side vector are owned by a distinct private entity that is unwilling to share or make public its row group or right hand side vector. By multiplying each privately held constraint group by an appr...
متن کاملPrivacy-Preserving Decision Tree Classification Over Horizontally Partitioned Data
Protection of privacy is one of important problems in data mining. The unwillingness to share their data frequently results in failure of collaborative data mining. This paper studies how to build a decision tree classifier under the following scenario: a database is horizontally partitioned into multiple pieces, with each piece owned by a particular party. All the parties want to build a decis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Data & Knowledge Engineering
سال: 2007
ISSN: 0169-023X
DOI: 10.1016/j.datak.2007.03.015